Comparing Semantically Related Sentences: The Case of Paraphrase Versus Subsumption

نویسندگان

  • Jahna Otterbacher
  • Dragomir R. Radev
چکیده

Paraphrases and other semantically related sentences present a challenge to NLP and IR applications such as multi-document sum-marization and question answering systems. While it is generally agreed that paraphrases contain approximately equivalent ideas, they often diier from one another in subtle, yet non-trivial, ways. In this paper, we examine semantic diierences in cases of paraphrase and subsumption, in an eeort to understand what makes one sentence sig-niicantly more informative than another. Using manually annotated data from the news domain, we concentrate on developing a framework for analyzing and comparing pairs of related sentences.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automatic Alignment of Common Information in Comparable Sentences of Portuguese

The ability to recognize distinct word sequences which refer to the same meaning is of extreme relevance for many applications in NLP, such as automatic summarization, question answering, generation, etc. In this paper we describe our first attempt at aligning common information between portuguese similar sentences. We propose a method based on lexical and syntatic information and some paraphra...

متن کامل

Effectiveness Evaluation for Paraphrase Method of Chinese Double Negation Based on Templates

By demand of expression, a double negation sentences are used in many situations. According to characteristics of double negation sentences, a paraphrase method based on templates is used. The method analysis sentence structure of double negation sentences, extract syntax frame and construct paraphrase templates. The syntax structure of double negative sentence and affirmation sentence are suit...

متن کامل

Syntax-based Alignment of Multiple Translations: Extracting Paraphrases and Generating New Sentences

We describe a syntax-based algorithm that automatically builds Finite State Automata (word lattices) from semantically equivalent translation sets. These FSAs are good representations of paraphrases. They can be used to extract lexical and syntactic paraphrase pairs and to generate new, unseen sentences that express the same meaning as the sentences in the input sets. Our FSAs can also predict ...

متن کامل

Comprehension of Complex Sentences in the Persian-Speaking Patients With Aphasia

Introduction: To study sentence comprehension in Persian-speaking Patients with Aphasia considering the factors of complexity. Methods: In this cross-sectional study, the performance of 6 non-fluent aphasic patients were tested and their performance was compared to 15 matched control group. Comprehension of semantically reversible sentences was assessed using a binary sentence-picture matching...

متن کامل

Extracting paraphrase patterns from bilingual parallel corpora

Paraphrase patterns are semantically equivalent patterns, which are useful in both paraphrase recognition and generation. This paper presents a pivot approach for extracting paraphrase patterns from bilingual parallel corpora, whereby the paraphrase patterns in English are extracted using the patterns in another language as pivots. We make use of log-linear models for computing the paraphrase l...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004